On Parity Classes
نویسنده
چکیده
This paper deals with various problems in lattice theory related to the notion of parity. Résumé. Sur les classes de parité. Nous considérons dans cet article divers problèmes de la théorie des réseaux liés à des questions de parité.
منابع مشابه
Graph operations on parity games and polynomial-time algorithms
Parity games are games that are played on directed graphs whose vertices are labeled by natural numbers, called priorities. The players push a token along the edges of the digraph. The winner is determined by the parity of the greatest priority occurring infinitely often in this infinite play. A motivation for studying parity games comes from the area of formal verification of systems by model ...
متن کاملParity games, separations, and the modal μ-calculus
The topics of this thesis are the modal μ-calculus and parity games. The modal μ-calculus is a common logic for model-checking in computer science. The modelchecking problem of the modal μ-calculus is polynomial time equivalent to solving parity games, a 2-player game on labeled directed graphs. We present the first FPT algorithms (fixed-parameter tractable) for the model-checking problem of th...
متن کاملLocally 2-Dimensional Sperner Problems Complete for the Polynomial Parity Argument Classes
In this paper, we define three Sperner problems on specific surfaces and prove that they are complete respectively for the classes PPAD, PPADS and PPA. This is the first time that locally 2-dimensional Sperner problems are proved to be complete for any of the polynomial parity argument classes.
متن کاملGraph Structure and Parity Games
We investigate the possible structural changes one can perform on a game graph without destroying the winning regions of the players playing a parity game on it. More precisely, given a game graph (G, p) for which we can efficiently compute winning regions, can we remove or add a vertex or edge or change a single priority and maintain at least part of the winning region? Also, what about restri...
متن کاملOn Parity Vectors of Latin Squares
The parity vectors of two Latin squares of the same side n provide a necessary condition for the two squares to be biembeddable in an orientable surface. We investigate constraints on the parity vector of a Latin square resulting from structural properties of the square, and show how the parity vector of a direct product may be obtained from the parity vectors of the constituent factors. Parity...
متن کامل